Satisfiability with Exponential Families
نویسندگان
چکیده
Fix a set S ⊆ {0, 1}∗ of exponential size, e.g. |S ∩ {0, 1}n| ∈ Ω(αn), α > 1. The S-SAT problem asks whether a propositional formula F over variables v1, . . . , vn has a satisfying assignment (v1, . . . , vn) ∈ {0, 1}n ∩S. Our interest is in determining the complexity of S-SAT. We prove that S-SAT is NP-complete for all context-free sets S. Furthermore, we show that if S-SAT is in P for some exponential S, then SAT and all problems in NP have polynomial circuits. This strongly indicates that satisfiability with exponential families is a hard problem. However, we also give an example of an exponential set S for which the S-SAT problem is not NP-hard, provided P 6= NP.
منابع مشابه
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
The exponential complexity of the satisfiability problem for a given class of Boolean circuits is defined to be the infimum of constants α such that the problem can be solved in time poly(m) 2, where m is the circuit size and n is the number of input variables [IP01]. We consider satisfiability of linear Boolean formula over the full binary basis and we show that the corresponding exponential c...
متن کاملThe Time Complexity of Constraint Satisfaction
We study the time complexity of (d, k)-CSP, the problem of deciding satisfiability of a constraint system C with n variables, domain size d, and at most k variables per constraint. We are interested in the question how the domain size d influences the complexity of deciding satisfiability. We show, assuming the Exponential Time Hypothesis, that two special cases, namely (d, 2)-CSP with bounded ...
متن کاملTesting a Point Null Hypothesis against One-Sided for Non Regular and Exponential Families: The Reconcilability Condition to P-values and Posterior Probability
In this paper, the reconcilability between the P-value and the posterior probability in testing a point null hypothesis against the one-sided hypothesis is considered. Two essential families, non regular and exponential family of distributions, are studied. It was shown in a non regular family of distributions; in some cases, it is possible to find a prior distribution function under which P-va...
متن کاملExpressive Logical Combinators for Free
A popular technique for the analysis of web query languages relies on the translation of queries into logical formulas. These formulas are then solved for satisfiability using an off-the-shelf satisfiability solver. A critical aspect in this approach is the size of the obtained logical formula, since it constitutes a factor that affects the combined complexity of the global approach. We present...
متن کاملPolynomial kernels collapse the W-hierarchy
We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the Whierarchy (i.e., W[P] = FPT). The collapsing results are also extended to assumed exponential kernels for problems in the class FPT. In particular, we establish a close relationship between polynomial (and exponential) kernelizability and the existence of sub-exponen...
متن کامل